Arithmetic Bit-Level Verification Using Network Flow Model
نویسندگان
چکیده
The paper presents a new approach to functional, bit-level verification of arithmetic circuits. The circuit is modeled as a network of adders and basic Boolean gates, and the computation performed by the circuit is viewed as a flow of binary data through such a network. The verification problem is cast as a Network Flow problem and solved using symbolic term rewriting and simple algebraic techniques. Functional correctness is proved by showing that the symbolic flow computed at the primary inputs is equal to the flow computed at the primary outputs. Experimental results show a potential application of the method to certain classes of arithmetic circuits.
منابع مشابه
The Effects of Arithmetic Encodings on SAT Solver Performance
As digital systems continue to grow, verification of these systems is becoming an increasingly important and difficult problem. To ensure a quick time-to-market, the verification problem must be addressed early in the design cycle. This requires the ability to verify systemlevel descriptions of hardware and embedded software systems, such as, C or Verilog, by proving assertions and proving func...
متن کاملVerification of arithmetic datapath designs using word-level approach - A case study
The paper describes an efficient method to prove equivalence between two integer arithmetic datapath designs specified at the register transfer level. The method is illustrated with an industrial ALU design. As reported in literature, solving it using a commercial equivalence checking tool required casesplitting, which limits its applicability to larger designs. We show how such a task can be s...
متن کاملFunction Verification of Combinational Arithmetic Circuits
FUNCTION VERIFICATION OF COMBINATIONAL ARITHMETIC CIRCUIT MAY 2015 DUO LIU B.S., JIANGNAN UNIVERSITY, WUXI, JIANGSU, CHINA M.S.E.C.E., UNIVERSITY OF MASSACHUSETTS AMHERST Directed by: Professor Maciej Ciesielski Hardware design verification is the most challenging part in overall hardware design process. It is because design size and complexity are growing very fast while the requirement for pe...
متن کاملThe Verification of a Bit-slice ALU
The verification of a bit-slice ALU has been accomplished using a mechanical theorem prover. This ALU has an n-bit design specification, which has been verified to implement its top-level specification. The ALU and top-level specifications were written in the Boyer-Moore logic. The verification was carried out with the aid of Boyer-Moore theorem prover in a hierarchical fashion.
متن کاملImproving Logic-level Representation of Taylor Expansion Diagram Using Attributed Edges
Abstract– Formal verification of complex digital systems requires a mechanism for efficient representation and manipulation of arithmetic as well as random Boolean functions. Although the Taylor Expansion Diagram can be used effectively to represent arithmetic expressions at the vector level, it is not efficient in the use of memory for representing bit-level logic expressions. In this paper, w...
متن کامل